Error detection algorithm for Lempel-Ziv-77 compressed data
نویسندگان
چکیده
منابع مشابه
Tutorial on Lempel-Ziv Data Compression Algorithm
In many scenario of digital communication and data processing, we may deal with strings of data which have certain structural regularities, making it possible for time-saving techniques of data compression. Given a discrete data source, the data compression problem is first to identify the limitations of the source, and second to devise a coding scheme which will best compress it subject to cer...
متن کاملLempel-Ziv Dimension for Lempel-Ziv Compression
This paper describes the Lempel-Ziv dimension (Hausdorff like dimension inspired in the LZ78 parsing), its fundamental properties and relation with Hausdorff dimension. It is shown that in the case of individual infinite sequences, the Lempel-Ziv dimension matches with the asymptotical Lempel-Ziv compression ratio. This fact is used to describe results on Lempel-Ziv compression in terms of dime...
متن کاملAutomata on Lempel-ziv Compressed Strings
Using the Lempel-Ziv-78 compression algorithm to compress a string yields a dictionary of substrings, i.e. an edge-labelled tree with an order-compatible enumeration, here called an LZ-trie. Queries about strings translate to queries about LZ-tries and hence can in principle be answered without decompression. We compare notions of automata accepting LZ-tries and consider the relation between ac...
متن کاملRedundancy estimates for the Lempel-Ziv algorithm of data compression
The problem of non-distorting compression (or coding) of sequences of symbols is considered. For sequences of asymptotically zero empirical entropy, a modi0cation of the Lempel–Ziv coding rule is o1ered whose coding cost is at most a 0nite number of times worse than the optimum. A combinatorial proof is o1ered for the well-known redundancy estimate of the Lempel–Ziv coding algorithm for sequenc...
متن کاملA Lempel-Ziv Compressed Structure for Document Listing
Document listing is the problem of preprocessing a set of sequences, called documents, so that later, given a short string called the pattern, we retrieve the documents where the pattern appears. While optimal-time and linear-space solutions exist, the current emphasis is in reducing the space requirements. Current document listing solutions build on compressed suffix arrays. This paper is the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Communications and Networks
سال: 2019
ISSN: 1229-2370,1976-5541
DOI: 10.1109/jcn.2019.000021